Selector table indexing & sparse arrays

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Indexing Functions of Regularly Sparse Arrays for Array Compilers

There are many applications involving arrays that contain non-zero components in regular geometric partitions. These include triangular, diagonal, tridiagonal, banded, etc. When computing with this type of arrays, they are usually stored in a packed form and computations are performed with only the non-zero components. This packed form requires an indexing function that maps an index of the arr...

متن کامل

STORING A SPARSE TABLE bY

The problem of storing and searching large sparse tables arises in compiling and in other areas of computer science. The standard technique for storing such tables is hashing, but hashing has poor worst-case performance. We consider good worst-case methods for storing a table of n entries, each an integer between 0 and N-l . For dynamic tables, in which look-ups and table additions are intermix...

متن کامل

Data Structures for Indexing Triple Table

Semantic-based approaches are relatively new technologies. Some of these technologies are supported by specifications of W3 Consortium, i.e. RDF, SPARQL and so on. There are many areas where semantic data can be utilized, e.g. social networks, annotation of protein sequences etc. From the physical database design point of view, several index data structures are utilized to handle this data. In ...

متن کامل

Scalable Inverted Indexing on NoSQL Table Storage

The development of data intensive problems in recent years has brought new requirements and challenges to storage and computing infrastructures. Researchers are not only doing batch loading and processing of large scale of data, but also demanding the capabilities of incremental updates and interactive analysis. Therefore, extending existing storage systems to handle these new requirements beco...

متن کامل

Random sparse arrays Preliminary 1.0 Random Sparse Arrays: An option for SKAI?

One of the major challenges in the design of SKAI is the required ultra-wide frequency bandwidth. The decade of bandwidth could be split up into several frequency regions. For each region a separate radiator could be used with an element distance smaller than λ/2 in order to avoid grating lobes. The main disadvantages of this concept are the complexity (costs) and mutual coupling between the va...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGPLAN Notices

سال: 1993

ISSN: 0362-1340,1558-1160

DOI: 10.1145/167962.165902